Identities for minors of the Laplacian, resistance and distance matrices

نویسندگان

  • R. B. Bapat
  • Sivaramakrishnan Sivasubramanian
چکیده

It is shown that if L and D are the Laplacian matrix and the distance matrix of a tree respectively, then any minor of the Laplacian equals the sum of the cofactors of the complementary submatrix of D, upto a sign and a power of 2. An analogous, more general result is proved for the Laplacian and the resistance matrix of any graph. A similar identity is proved for graphs in which each block is a complete graph on r vertices, and for q-analogs of the matrices in case of a tree. The main tool is an identity for the minors of a matrix and its inverse.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs

Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...

متن کامل

Ela a Note on Block Representations of the Group Inverse of Laplacian Matrices

Let G be a weighted graph with Laplacian matrix L and signless Laplacian matrix Q. In this note, block representations for the group inverse of L and Q are given. The resistance distance in a graph can be obtained from the block representation of the group inverse of L.

متن کامل

On Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

متن کامل

Minor identities for quasi-determinants and quantum determinants

We present several identities involving quasi-minors of noncommutative generic matrices. These identities are specialized to quantum matrices, yielding q-analogues of various classical determinantal formulas.

متن کامل

1 N ov 2 01 6 Two statements on path systems related to quantum minors

In [4] we gave a complete combinatorial characterization of homogeneous quadratic identities for minors of quantum matrices. It was obtained as a consequence of results on minors of matrices of a special sort, the so-called path matrices PathG generated by paths in special planar directed graphs G. In this paper we prove two assertions that were stated but left unproved in [4]. The first one sa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009